Finding Shortest MultiPaths with O(N) Message Complexity
نویسندگان
چکیده
This paper presents a distributed algorithm for discovering multiple shortest paths in an ad hoc network from a source s to a destination d. For each neighbor x of s which lies on a loop-free sd -path, we find one shortest sd -path via node x. The algorithm requires only O(N) many messages.
منابع مشابه
A Distributed Enumeration Algorithm and Applications to All Pairs Shortest Paths, Diameter
We consider the standard message passing model; we assume the system is fully synchronous: all processes start at the same time and time proceeds in synchronised rounds. In each round each vertex can transmit a different message of size O(1) to each of its neighbours. This paper proposes and analyses a distributed enumeration algorithm of vertices of a graph having a distinguished vertex which ...
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملOn Finding a Shortest Path in Circulant Graphs with Two Jumps
In this paper we present algorithms for finding a shortest path between two vertices of any weighted undirected and directed circulant graph with two jumps. Our shortest path algorithm only requires O(logN) arithmetic steps and the total bit complexity is O(log N), where N is the number of the graph’s vertices. This method has been derived from some Closest Vector Problems (CVP) of lattices in ...
متن کاملA Distributed Algorithm for the Minimum Diameter Spanning Tree Problem
We present a new algorithm, which solves the problem of distributively nding a minimum diameter spanning tree of any arbitrary positively real-weighted graph. We use a new fast linear time intermediate all-pairs shortest paths routing protocol. The resulting distributed algorithm is asynchronous, it works for arbitrary named network, and achieves O(n) time complexity and O(nm) message complexity.
متن کاملA Distributed Algorithm for Constructing a Minimum Diameter Spanning Tree
We present a new algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of any (non-negatively) real-weighted graph G = (V, E, ω). As an intermediate step, we use a new, fast, linear-time all-pairs shortest paths distributed algorithm to find an absolute center of G. The resulting distributed algorithm is asynchronous, it works for named asynchronous arbi...
متن کامل